f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
p(s(X)) → X
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
p(s(X)) → X
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X
ACTIVATE(n__f(X)) → F(X)
F(s(0)) → F(p(s(0)))
F(s(0)) → P(s(0))
f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
p(s(X)) → X
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
ACTIVATE(n__f(X)) → F(X)
F(s(0)) → F(p(s(0)))
F(s(0)) → P(s(0))
f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
p(s(X)) → X
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
F(s(0)) → F(p(s(0)))
f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
p(s(X)) → X
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(s(0)) → F(p(s(0)))
The value of delta used in the strict ordering is 3.
POL(s(x1)) = (4)x_1
POL(p(x1)) = (1/4)x_1
POL(0) = 4
POL(F(x1)) = (1/4)x_1
p(s(X)) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
p(s(X)) → X
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X